Functional Flow Simulation Based Analysis of Protein Interaction Network.

Computational Framework for Microstructural Bone Dynamics Model and Its Evaluation.

An improved projection pursuit clustering model and its application based on Quantum%2Dbehaved PSO.

On Mining Statistically Significant Attribute Association Information.

Identification of functional hubs and modules by converting interactome networks into hierarchical ordering of proteins.

Predicting protein function by frequent functional association pattern mining in protein interaction networks.


Restructuring Protein Interaction Networks to Reveal Structural Hubs and Functional Organizations.


Mining of Attribute Interactions Using Information Theoretic Metrics.

Flex Transactions.
We present an execution model for distributed transactions that can be employed for multidatabase systems. We use the Flex Transaction model that has been proposed as a highly general and flexible tool for the specification of distributed transactions and extend it by allowing nested and possibly recursive transaction specifications. We show how a given transaction specification and its execution model can be mapped into a representation in a new concurrent Prolog language, the VPL (Vienna Parallel Logic) language. The representation in VPL can be considered as an executable specification. We show some optimizations concerning this mapping and define a significant subclass of Flex Transactions with a declarative representation in VPL that can be modeled by AND/OR structures. We argue that it is more advantageous to use VPL directly for the transaction specification because it provides more flexibility and more control aspects than the Flex Transaction model. 1 Introduction  A transacti...
Semantic similarity based feature extraction from microarray expression data.

A novel information theoretic method for detecting gene%2Dgene and gene%2Denvironment interactions in complex diseases.

Multi%2Dagent Model Analysis of the Containment Strategy for Avian Influenza %28AI%29 in South Korea.

Multi%2Dagent Model Analysis of the Containment Strategy for Avian Influenza %28AI%29 in South Korea.

Discovering Frequent Patterns of Functional Associations in Protein Interaction Networks for Function Prediction.

Future directions in multimedia retrieval  impact of new technology.


SS%2DClusterTree a subspace clustering based indexing algorithm over high%2Ddimensional image features.


A probabilistic framework to predict protein function from interaction data integrated with semantic knowledge.

CASCADE a novel quasi all paths%2Dbased network analysis algorithm for clustering biological interactions.

Functional module detection by functional flow pattern mining in protein interaction networks.

SIGN reliable protein interaction identification by integrating the Similarity In GO and the similarity in protein interaction Networks.

Optimizing Flow%2Dbased Modularization by Iterative Centroid Search in Protein Interaction Networks.

Modularization of Protein Interaction Networks by Incorporating Gene Ontology Annotations.



Feature Extraction from Microarray Expression Data by Integration of Semantic Knowledge.

Semantic integration to identify overlapping functional modules in protein interaction networks.

Mining gene%2Dsample%2Dtime microarray data a coherent gene cluster discovery approach.

Prediction of Protein Function Using Common%2DNeighbors in Protein%2DProtein Interaction Networks.

Efficient Modularization of Weighted Protein Interaction Networks using k%2DHop Graph Reduction.

Digitalization of coastal management and decision making supported by multi%2Ddimensional geospatial information and analysis.
This paper presents the status and outcomes of the fourth year of an NSF-funded Digital Government Program project. During this four-year period, geo-spatial technologies have been investigated and developed to enhance the operational capabilities of federal, state, and local agencies responsible for coastal management and decision making. Successful collaborations have been established among research laboratories and government agencies in the areas of data collection and analysis, hydrodynamic modeling, development of web-based systems, and real-world applications of research results. Categories and Subject Descriptors:
Identification of Overlapping Functional Modules in Protein Interaction Networks Information Flow%2Dbased Approach.

Boost Feature Subset Selection A New Gene Selection Algorithm for Microarray Dataset.

Towards Detecting Protein Complexes from Protein Interaction Data.

A novel functional module detection algorithm for protein%2Dprotein interaction networks.

VizStruct for visualization of genome%2Dwide SNP analyses.

Extracting semantic concepts from images a decisive feature pattern mining approach.

Extracting semantic concepts from images a decisive feature pattern mining approach.

A Two%2DStep Approach for Clustering Proteins Based on Protein Interaction Profile.

Selecting Informative Genes from Microarray Dataset by Incorporating Gene Ontology.

A Topological Measurement for Weighted Protein Interaction Network.

A General Approach to Mining Quality Pattern%2DBased Clusters from Microarray Data.
Abstract. Pattern-based clustering has broad applications in microarray data analysis, customer segmentation, e-business data analysis, etc. However, pattern-based clustering often returns a large number of highlyoverlapping clusters, which makes it hard for users to identify interesting patterns from the mining results. Moreover, there lacks of a general model for pattern-based clustering. Different kinds of patterns or different measures on the pattern coherence may require different algorithms. In this paper, we address the above two problems by proposing a general quality-driven approach to mining top-k quality pattern-based clusters. We examine our quality-driven approach using real world microarray data sets. The experimental results show that our method is general, effective and efficient. 1
Digitalization of coastal management and decision making supported by multi%2Ddimensional geospatial information and analysis.
This paper presents the status and outcomes of the fourth year of an NSF-funded Digital Government Program project. During this four-year period, geo-spatial technologies have been investigated and developed to enhance the operational capabilities of federal, state, and local agencies responsible for coastal management and decision making. Successful collaborations have been established among research laboratories and government agencies in the areas of data collection and analysis, hydrodynamic modeling, development of web-based systems, and real-world applications of research results. Categories and Subject Descriptors:
Integration of multidimensional geospatial information for coastal management and decision%2Dmaking.

Mining Cross%2DGraph Quasi%2DCliques in Gene Expression and Protein Interaction Data.

Towards Exploring Interactive Relationship between Clusters and Outliers in Multi%2DDimensional Data Analysis.

Exploiting anarchy in networks a game%2Dtheoretic approach to combining fairness and throughput.

Virtual Gene A Gene Selection Algorithm for Sample Classification on Microarray Datasets.

On mining cross%2Dgraph quasi%2Dcliques.
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-market customer segmentation, a group of customers who behave similarly in multiple markets should be considered as a more coherent and more reliable cluster than clusters found in a single market. As another example, in bioinformatics, by joint mining of gene expression data and protein interaction data, we can find clusters of genes which show coherent expression patterns and also produce interacting proteins. Such clusters may be potential pathways. In this paper, we investigate a novel data mining problem, mining cross-graph quasi-cliques, which is generalized from several interesting applications such as cross-market customer segmentation and joint mining of gene expression data and protein interaction data. We build a general model for mining cross-graph quasicliques, show why the complete set of cross-graph quasi-cliques cannot be found by previous data mining methods, and study the complexity of the problem. While the problem is difficult, we develop an efficient algorithm, Crochet, which exploits several interesting and effective techniques and heuristics to efficaciously mine cross-graph quasi-cliques. A systematic performance study is reported on both synthetic and real data sets. We demonstrate some interesting and meaningful cross-graph quasi-cliques in bioinformatics. The experimental results also show that algorithm Crochet is efficient and scalable.
An Interactive Approach to Mining Gene Expression Data.
Effective identification of co-expressed genes and coherent patterns in gene expression data is an important task in bioinformatics research and biomedical applications. Several clustering methods have recently been proposed to identify co-expressed genes that share similar coher-ent patterns. However, there is no objective standard for groups of co-expressed genes. The interpretation of co-expression heavily depends on domain knowledge. Furthermore, groups of co-expressed genes in gene expression data are often highly connected through a large number of “intermediate” genes. There may be no clear boundaries to separate clusters. Clustering gene expression data also faces the challenges of satisfying biological domain requirements and addressing the high connectivity of the data sets.

A Shrinking%2DBased Clustering Approach for Multidimensional Data.

SynchRuler A Rule%2DBased Flexible Synchronization Model with Model Checking.


Interrelated Two%2DWay Clustering and its Application on Gene Expression Data.

Virtual Gene Using Correlations Between Genes to Select Informative Genes on Microarray Datasets.

Feature Selection for Classifying High%2DDimensional Numerical Data.

Digitalization of Coastal Management and Decision Making Supported by Multi%2DDimensional Geospatial Information and Analysis.
This paper presents the status and outcomes of the fourth year of an NSF-funded Digital Government Program project. During this four-year period, geo-spatial technologies have been investigated and developed to enhance the operational capabilities of federal, state, and local agencies responsible for coastal management and decision making. Successful collaborations have been established among research laboratories and government agencies in the areas of data collection and analysis, hydrodynamic modeling, development of web-based systems, and real-world applications of research results. Categories and Subject Descriptors:
Spatial Technologies for Coastal Management.

Very Large Scale Multidimensional Data Management and Retrieval for USGS and NIMA Imagery.

An Adaptive Density%2DBased Clustering Algorithm for Spatial Database with Noise.

Integrating virtual camera controls into digital video.

PatternQuest learning patterns of interest using relevance feedback in multimedia information retrieval.

Sprite pyramid for videos and images having finite%2Ddepth scenes.

Mining coherent gene clusters from gene%2Dsample%2Dtime microarray data.
Extensive studies have shown that mining microarray data sets is important in bioinformatics research and biomedical applications. In this paper, we explore a novel type of genesample-time microarray data sets, which records the expression levels of various genes under a set of samples during a series of time points. In particular, we propose the mining of coherent gene clusters from such data sets. Each cluster contains a subset of genes and a subset of samples such that the genes are coherent on the samples along the time series. The coherent gene clusters may identify the samples corresponding to some phenotypes (e.g., diseases), and suggest the candidate genes correlated to the phenotypes. We present two efficient algorithms, namely the Sample-Gene Search and the Gene-Sample Search, to mine the complete set of coherent gene clusters. We empirically evaluate the performance of our approaches on both a real microarray data set and synthetic data sets. The test results have shown that our approaches are both efficient and effective to find meaningful coherent gene clusters.
A Shrinking%2DBased Dimension Reduction Approach for Multi%2DDimensional Data Analysis.

GPX Interactive Mining of Gene Expression Data.

VizStruct exploratory visualization for gene expression profiling.

ESPD a pattern detection model underlying gene expression profiles.

Cluster Analysis for Gene Expression Data A Survey.
Abstract—DNA microarray technology has now made it possible to simultaneously monitor the expression levels of thousands of genes during important biological processes and across collections of related samples. Elucidating the patterns hidden in gene expression data offers a tremendous opportunity for an enhanced understanding of functional genomics. However, the large number of genes and the complexity of biological networks greatly increases the challenges of comprehending and interpreting the resulting mass of data, which often consists of millions of measurements. A first step toward addressing this challenge is the use of clustering techniques, which is essential in the data mining process to reveal natural structures and identify interesting patterns in the underlying data. Cluster analysis seeks to partition a given data set into groups based on specified features so that the data points within a group are more similar to each other than the points in different groups. A very rich literature on cluster analysis has developed over the past three decades. Many conventional clustering algorithms have been adapted or directly applied to gene expression data, and also new algorithms have recently been proposed specifically aiming at gene expression data. These clustering algorithms have been proven useful for identifying biologically relevant groups of genes and samples. In this paper, we first briefly introduce the concepts of microarray technology and discuss the basic elements of clustering on gene expression data. In particular, we divide cluster analysis for gene expression data into three categories. Then, we present specific challenges pertinent to each clustering category and introduce several representative approaches. We also discuss the problem of cluster validation in three aspects and review various methods to assess the quality and reliability of clustering results. Finally, we conclude this paper and suggest the promising trends in this field. Index Terms—Microarray technology, gene expression data, clustering.
Interactive pattern analysis for relevance feedback in multimedia information retrieval.

DHC A Density%2DBased Hierarchical Clustering Method for Time Series Gene Expression Dat.

Enhanced visualization of time series through higher fourier harmonics.

Mining multiple phenotype structures underlying gene expression profiles.

Fourier Harmonic Approach for Visualizing Temporal Patterns of Gene Expression Data.

Adaptive Pattern Discovery for Interactive Multimedia Retrieval.
Relevance feedback has been an indispensable component for multimedia retrieval systems. In this paper, we present an adaptive pattern discovery method, which addresses relevance feedback by interactively discovering meaningful patterns of relevant objects. To facilitate pattern discovery, we first present a dynamic feature extraction method, which aims to alleviate the curse of dimensionality by extracting a feature subspace using balanced information gain. In the feature subspace, we train an online pattern classification method called adaptive random forests to classify multimedia objects as relevant or irrelevant. Our adaptive random forests adapts the traditional classification method known as random forests for relevance feedback. It improves the efficiency of pattern discovery by choosing the most-informative samples for online learning. Extensive experiments are carried out on a Corel image set (with 31,438 images) to evaluate the performance of our method as compared against the state-of-the-art approaches.
A Spatio%2DTemporal Decision Making System for Coastal Change Monitoring and Coastal Management.

Integration of Multi%2DSource Spatial Information for Coastal Management and Decision Making.
Coastal Management and Decision Making Supported by Multi-Dimensional Geospatial Information and Analysis&#034;. One of the primary objectives of the second year is to develop and integrate multiple spaceborne, airborne, and in-situ remotely sensed measurements, spatio-temporal databases, coastal hydrological modeling, and geospatial information analysis for coastal management and decision making. The developed coastal management and decision-making system includes applications for coastal mapping and change detection, water surface modeling and analysis, on-site coastal management and decision-making, and web-based spatial data manipulation. Studies have also been conducted on uncertainties in the used coastal spatial data. The above system has been tested at a pilot site along Ohio&#039;s Lake Erie shore and is to be applied to a new test site in Tampa Bay, Florida.
SemView A Semantic%2Dsensitive Distributed Image Retrieval System.
State-of-the-art image retrieval techniques have been developed to support high-level (semantics) querying and browsing of images. For certain user queries, it is also very important to know about the information about the remote image databases on the Internet so that the queries can be guided toward the most relevant databases. In this paper, we introduce a novel system, SemView, which supports both visual and semantic queries and intelligently ranks the distributed image databases for the queries. Our system summarizes the visual and semantic contents of each database in a metadatabase, which is a collection of automatically generated visual, semantic and statistical metadata. With the metadatabase, our system can effectively guide the user queries toward the most relevant image databases in a distributed environment for better retrieval performance.
Interactive exploration of coherent patterns in time%2Dseries gene expression data.
Discovering coherent gene expression patterns in time-series gene expression data is an important task in bioinformatics research and biomedical applications. In this paper, we propose an interactive exploration framework for mining coherent expression patterns in time-series gene expression data. We develop a novel tool, coherent pattern index graph, to give users highly confident indications of the existences of coherent patterns. To derive a coherent pattern index graph, we devise an attraction tree structure to record the genes in the data set and summarize the information needed for the interactive exploration. We present fast and scalable algorithms to construct attraction trees and coherent pattern index graphs from gene expression data sets. We conduct an extensive performance study on some real data sets to verify our design. The experimental results strongly show that our approach is more effective than the state-of-the-art methods in mining real gene expression data, and is scalable in mining large data sets.
Mining phenotypes and informative genes from gene expression data.
Mining microarray gene expression data is an important research topic in bioinformatics with broad applications. While most of the previous studies focus on clustering either genes or samples, it is interesting to ask whether we can partition the complete set of samples into exclusive groups (called phenotypes) and find a set of informative genes that can manifest the phenotype structure. In this paper, we propose a new problem of simultaneously mining phenotypes and informative genes from gene expression data. Some statistics-based metrics are proposed to measure the quality of the mining results. Two interesting algorithms are developed: the heuristic search and the mutual reinforcing adjustment method. We present an extensive performance study on both real-world data sets and synthetic data sets. The mining results from the two proposed methods are clearly better than those from the previous methods. They are ready for the real-world applications. Between the two methods, the mutual reinforcing adjustment method is in general more scalable, more effective and with better quality of the mining results.
A Shrinking%2DBased Approach for Multi%2DDimensional Data Analysis.
Existing data analysis techniques have difficulty  in handling multi-dimensional data. In this paper,  we first present a novel data preprocessing technique  called shrinking which optimizes the inner  structure of data inspired by the Newton&#039;s Universal  Law of Gravitation[22] in the real world. This data
Interrelated Clustering An Approach for Gene Expression Data Analysis.

Introduction to the Special Issue on Bioinformatics.

VizCluster and its Application on Classifying Gene Expression Data.

ClusterTree Integration of Cluster Representation and Nearest%2DNeighbor Search for Large Data Sets with High Dimensions.

Introduction to the Special Issue on Content%2DBased Image Retrieval %28CBIR%29 Guest Editors.

Analyzing scenery images by monotonic tree.
Content-based image retrieval (CBIR) has been an active research area in the last ten years, and a variety of techniques have been developed. However, retrieving images on the basis of low-level features has proven unsatisfactory, and new techniques are needed to support high-level queries. Research efforts are needed to bridge the gap between high-level semantics and low-level features. In this paper, we present a novel approach to supporting semantics-based image retrieval. Our approach is based on the monotonic tree, a derivation of the contour tree for use with discrete data. The structural elements of an image are modeled as branches (or subtrees) of the monotonic tree. These structural elements are classified and clustered on the basis of such properties as color, spatial location, harshness and shape. Each cluster corresponds to some semantic feature. This scheme is applied to the analysis and retrieval of scenery images. Comparisons of experimental results of this approach with conventional techniques using low-level features, demonstrate the effectiveness of our approach. Keywords: Content-based image retrieval, image feature extraction, annotation, semantics retrieval, monotonic tree 1 
Towards interactive exploration of gene expression patterns.

Automatic Annotation and Retrieval of Images.
We propose a novel approach for semantics-based image annotation and retrieval. Our approach is based on monotonic tree, a derivation of contour tree for discrete data. Monotonic tree provides a way to bridge the gap between the high-level semantics and low-level features. Each branch (subtree) of the monotonic tree is termed as a structural element if its area is within a given scale. The structural elements are classified and clustered based on their low level features such as color, spatial location, harshness, and shape. Each cluster corresponds to some semantic feature. The category keywords indicating the semantic features are automatically annotated to the images. Based on the semantic features extracted from images, high-level (semantics-based) querying and browsing of images can be achieved. The experimental results demonstrate the effectiveness of our approach.
Visualized Classification of Multiple Sample Types.
The goal of the knowledge discovery and data mining is to extract the useful knowledge from the given data. Visualization enables us to  nd structures, features, patterns, and relationships in a dataset by presenting the data in various graphical forms with possible interactions. Recently, DNA microarray technology provides a board snapshot of the state of the cell by measuring the expression levels of thousands of genes simultaneously. Such information can thus be used to analyze dierentsamplesbythegene expression pro  les. Last few years sawmany cluster analysis and classsi  cation methods extensively be applied to capture the similarity pattern of gene expressions. Anovel interactive visualization approach, VizCluster, was presented and applied to classify samples of two types. It combines the merits of both high dimensional projection scatter plot and parallel coordinate plot, taking advantage of graphical visualization methods to reveal the underlining data patterns. In this paper, we expand VizCluster to classify multiple types of samples. First, weidentify genes which are dierentially expressed across the sample groups. Then we apply VizCluster to build classi  ers based on those genes. Finally, classi  ers were evaluated by either hold out or cross validation. Five gene expression data sets were used to illustrate the approach. Experimental performance demonstrated the feasibility and usefulness of this approach.
Semantics%2DBased Image Retrieval by Region Saliency.
Abstract. We propose a new approach for semantics-based image retrieval. We use color-texture classification to generate the codebook which is used to segment images into regions. The content of a region is characterized by its self-saliency and the lower-level features of the region, including color and texture. The context of regions in an image describes their relationships, which are related to their relative-saliencies. High-level (semantics-based) querying and query-by-example are supported on the basis of the content and context of image regions. The experimental results demonstrate the effectiveness of our approach. 1
Webview A Distributed Geographical Image Retrieval System.

Monotonic Tree.
Contour trees have been used in geographic information systems  (GIS) and medical imaging to display scalar data. Contours are  only defined for continuous functions. For an image represented by discrete  data, a continuous function is first defined as an interpolation of  the data. Then the contour tree is defined on this continuous function. In  this paper, we introduce a new concept termed monotonic line, which is  directly defined on discrete data. All monotonic lines in an image form a  tree, called monotonic tree. As compared with contour trees, monotonic  trees avoid the step of interpolation, thus can be computed more efficiently.
Interactive Visualization and Analysis for Gene Expression Data.

An adaptive texture image retrieval system using wavelets.

Global motion estimation from semi%2Ddynamic video using motion sensors.

A feature re%2Dweighting approach for relevance feedback in image retrieval.
Users of image databases often prefer to retrieve relevant images by categories. Unfortunately, images are usually indexed by low-level features like color, texture and shape, which often fail to capture high-level concepts well. To address this issue, relevance feedback has been extensively used to associate low-level image features with highlevel concepts. Among all existing relevance feedback approaches, query movement and feature re-weighting have been proven to be suitable for large-scaled image databases with high dimensional image features. In this paper, we present a feature re-weighting approach using relevant images as well as irrelevant ones in the relevance feedback. As far as feature re-weighting approaches are concerned, one of their common drawbacks is that the feature re-weighting process is prone to be trapped by suboptimal states. To overcome this problem, we introduce a disturbing factor, which is based on the Fisher criterion, to push the feature weights out of sub-optimum. Experimental results on a large-scaled image database with 31,438 COREL images demonstrate the effectiveness of the presented method.
Locating Image Background By Monotonic Tree.
In this paper, we discuss an approach to locating image background, which is based on monotonic tree, a derivation of contour tree for discrete data. We first make two assumptions about image background. As compared with the foreground shapes, the background regions are (1) smoother in intensity; and (2) peripheral in location. In an input image, the harshness of the foreground is characterized by intensity peaks and valleys, which are modeled in monotonic tree as small textons whose altitudes are high. Based on this, we can find the texton pattern for foreground objects. Then the foreground region, and thus the background region are rendered. Experiments show that our scheme can effectively locate background in images which satisfy the two assumptions above.
Interactive Patterns Analysis for Searching Multimedia Databases.
Relevance feedback is a mechanism to interactively learn the user&#039;s query concept online, and has been extensively  used to improve the performance of multimedia information retrieval. In this paper, we present a novel interactive  pattern analysis method, which reduces the relevance feedback to a two-class classification problem, and classifies  multimedia objects as relevant or irrelevant. From those objects that are classified as relevant, our approach returns  the top    nearest neighbors of the query to the user. To classify multimedia objects, we employ a pattern classification  algorithm called random forests, which is a machine learning algorithm with proven good performance on many  traditional classification problems. By using a novel two-level resampling method, we adapt the original random  forests to an interactive algorithm, which achieves noticeable gains in efficiency over the original random forests. We  empirically compare our method with previously well-known relevance feedback approaches on a large-scaled image  database (with 31,438 COREL images), and report promising results of our method.

VizCluster An Interactive Visualization Approach to Cluster Analysis and Its Application on Microarray Data.

Modeling and Verification of Interactive Flexible Multimedia Presentations Using PROMELA%2FSPIN.

Automatic Annotation and Retrieval of Images.
We propose a novel approach for semantics-based image annotation and retrieval. Our approach is based on monotonic tree, a derivation of contour tree for discrete data. Monotonic tree provides a way to bridge the gap between the high-level semantics and low-level features. Each branch (subtree) of the monotonic tree is termed as a structural element if its area is within a given scale. The structural elements are classified and clustered based on their low level features such as color, spatial location, harshness, and shape. Each cluster corresponds to some semantic feature. The category keywords indicating the semantic features are automatically annotated to the images. Based on the semantic features extracted from images, high-level (semantics-based) querying and browsing of images can be achieved. The experimental results demonstrate the effectiveness of our approach.
Theory of keyblock%2Dbased image retrieval.

NetMedia Streaming Multimedia Presentations in Distributed Environments.


Interrelated Two%2Dway Clustering An Unsupervised Approach for Gene Expression Data Analysis.

A method for measuring the complexity of image databases.

PLUS a probe%2Dloss utilization streaming mechanism for distributed multimedia presentation systems.

Advanced feature extraction for keyblock%2Dbased image retrieval.

FindOut Finding Outliers in Very Large Datasets.
Signal processing techniques have been introduced to transform images for image enhancement, filtering and restoration, analysis, and reconstruction. In this paper, we apply signal processing techniques to solve important KDD problems. In particular, we introduce a novel deviation (or outlier) detection approach, termed FindOut, based on wavelet transform. The main idea in FindOut is to remove the clusters from the original data and then identify the outliers. Although previous research showed that such techniques may not be effective because of the nature of the clustering, FindOut can successfully identify various percentages of outliers from large datasets. Thus, we can combine both clustering and outliers detection in a unified approach. Experimental results on very large datasets are presented which show the efficiency and effectiveness of the proposed approach. 1 Introduction  Data mining is a process of extracting valid, previously unknown, and ultimately comprehensible informat...
Middle%2Dtier for multimedia synchronization.
Emerging applications like asynchronous distant learning and collaborative engineering require organization of media streams as multimedia presentations. The browsing of presentations enables interactive surfing of the multimedia documents. We propose spatiotemporal browsing of multimedia presentations in the sense that browsing can be performed both in the spatial and temporal domain.
Interrelated Two%2Dway Clustering An Unsupervised Approach for Gene Expression Data Analysis.

Stationary Background Generation In Mpeg Compressed Video Sequences.

Using Thesaurus To Model Keyblock%2DBased Image Retrieva.

Using Keyblock Statistics to Model Image Retrieval.

Interactive Multimedia Presentation Management in Distributed Multimedia Systems.

Global Scheduling for Flexible Transactions in Heterogeneous Distributed Database Systems.
AbstractÐA heterogeneous distributed database environment integrates a set of autonomous database systems to provide global database functions. A flexible transaction approach has been proposed for the heterogeneous distributed database environments. In such an environment, flexible transactions can increase the failure resilience of global transactions by allowing alternate (but in some sense equivalent) executions to be attempted when a local database system fails or some subtransactions of the global transaction abort. In this paper, we study the impact of compensation, retry, and switching to alternative executions on global concurrency control for the execution of flexible transactions. We propose a new concurrency control criterion for the execution of flexible and local transactions, termed F-serializability, in the error-prone heterogeneous distributed database environments. We then present a scheduling protocol that ensures F-serializability on global schedules. We also demonstrate that this scheduler avoids unnecessary aborts and compensation. Index TermsÐHeterogeneous and autonomous database, transaction management, concurrency control, flexible transactions, serializability. 1
Keyblock an approach for content%2Dbased image retrieval.

Advanced feature extraction for Keyblock%2Dbased image retrieval.


ACQ An Automatic Clustering and Querying Approach for Large Image Databases.
Large image collections such as web-based image databases are being built in various locations. Because of the diversity of such image data collections, clustering images becomes an important and non-trivial problem. Such clustering tries to find the densely populated regions in the feature space to be used for efficient image retrieval. In this paper, we present an automatic clustering and querying (ACQ) approach for large image databases. Our approach can efficiently detect clusters of arbitrary shape. It does not require the number of clusters to be known a priori and is insensitive to the noise (outliers) and the order of input data. Based on this clustering approach, efficient image querying is supported. Experiments demonstrate the effectiveness and efficiency of the approach. 1 Introduction  With the advent of the World Wide Web (WWW), large volume of image data are now made available over the web for information sharing and it is possible to access such large image repositories...
Supporting Multi%2DExample Image Queries in Image Databases.
Query by example (or image) is commonly supported in image databases. However, it is also desirable for a contentbased image retrieval system to support multi-example queries. A multi-example query refers to a query which contains one or more example images. Although multiexample query problem can be solved by dividing it to several single-example queries, how to merge these singleexample queries&#039; results to find the top n relevant images is a non-trivial problem. The Netview system, which is a geographic data retrieval system developed at the State University of New York at Buffalo, provides users with flexible choices to adjust query parameters such as importance of each example image and result combination strategies to generate satisfiable retrieval output. In this paper, we formally define the multi-example image query problem. We then present a variety of result combination strategies, including linear distance combination and non-linear result combination. We finally discuss the...
ClusterTree Integration of Cluster Representation and Nearest Neighbor Search for Image Databases.

Metadata Model
The Natural Environment Research Council (NERC) DataGrid (NDG) aims to provide a framework for the discovery and use of data needed in NERC research. To support this, the NDG has developed a metadata and data model. The data model is directly concerned with the representation and use of the data, with the metadata model covering the discovery and higher-level considerations.
QoS Management in Educational Digital Library Environments.
Advances in multimedia computing technologies offer new approaches to the support of computerassisted education and training within many application domains. Novel interactive presentation tools can be built to enhance traditional teaching methods with more active learning. Since a variety of user expectations are possible in such an environment, research must address the incorporation of these factors into presentation tools. During an interactive learning/training process, presentation tools must be able to handle various types of delays. A flexibly adjustable quality of service (QoS) should thus be supported. In this paper, we investigate a framework and systematic strategies for supporting the continuous and synchronized retrieval and presentation of multimedia data streams in a client/server distributed multimedia environment for educational digital libraries. Specifically, we establish a practical framework for specifying multimedia objects, tasks, schedules, and synchronization ...
Guest Editorial Continuous Media Databases.


ACQ an automatic clustering and querying approach for large image databases.
Large image collections such as web-based image databases are being built in various locations. Because of the diversity of such image data collections, clustering images becomes an important and non-trivial problem. Such clustering tries to find the densely populated regions in the feature space to be used for efficient image retrieval. In this paper, we present an automatic clustering and querying (ACQ) approach for large image databases. Our approach can efficiently detect clusters of arbitrary shape. It does not require the number of clusters to be known a priori and is insensitive to the noise (outliers) and the order of input data. Based on this clustering approach, efficient image querying is supported. Experiments demonstrate the effectiveness and efficiency of the approach. 1 Introduction  With the advent of the World Wide Web (WWW), large volume of image data are now made available over the web for information sharing and it is possible to access such large image repositories...
Optimally Ensured Interactive Service in Distributed Multimedia Presentation Systems.
In this paper, we develop a new service to support optimally ensured user interactions with minimum latency in interactive distributed multimedia presentation environments. The novelty of our scheme is to reduce bandwidth requirements of a network in exchange of memory at the client side, because we expect an increase in network load in the next years in comparison to falling memory prices. Utilizing the properties of smoothing algorithms presented in the literature, we introduce the concepts of the interactive river bed and optimal interactive river bed, which guarantee optimal interactive service over the whole playback time of the video stream. Our approach provides optimal service for a given buffer size. We also derive requirements for a minimal buffer size in which we can give the optimal boundaries for an interactive transmission plan. Experiments demonstrate the effectiveness of the approach.  1 Introduction  Multimedia presentations can be constructed from various databases (o...
NetMedia Synchronized Streaming of Multimedia Presentations in Distributed Environments.
In this paper, we present the design strategies of a clientserver distributed multimedia presentation system that can flexibly support streaming continuous media data, in realtime, across Internet. In particular, we focus on the real-time buffer management and end-to-end data transmission. We present an effective and practical buffer management technique to address network delays and misordering of arriving data at the client side. We also develop a novel end-to-end transmission control protocol which can guarantee the availability and timeliness of data as demanded.  1 Introduction  There has been increasing interest in flexibly constructing and manipulating heterogeneous presentations from multimedia data resources to support sophisticated applications. In these applications, information from multimedia data resources at one location must be made available at other remote locations for purposes of collaborative engineering, educational learning and tutoring, interactive computer-base...
Efficiently Detecting Arbitrary Shaped Clusters in Image Databases.
Image databases contain data with high dimensions. Finding interesting patterns in these databases poses a very challenging problem because of the scalability, lack of domain knowledge and complex structures of the embedded clusters. High dimensionality adds severely to the scalability problem. In this paper, we introduce WaveCluster , a novel approach to apply wavelet-based techniques for clustering high dimensional data. Using a hash-based data structure to represent the dataset, we offer a detailed technique to apply wavelet transform on the hashed feature space. We demonstrate that the cost of clustering can be reduced dramatically yet maintaining all the advantages of wavelet-based clustering. This hash-based data representation can be applied for any grid-based clustering approaches. The experimental results show the effectiveness and efficiency of our method on high dimensional datasets.
NetMedia Giving Control to Distributed Multimedia Presentation Systems.

GiView A Multi%2DResolution Geographical Data Retrieval System.

A Multi%2DResolution Content%2DBased Retrieval Approach for Geographic Images.
Current retrieval methods in geographic image databases use only pixel-by-pixel spectral information. Texture is an important property of geographical images that can improve retrieval effectiveness and efficiency. In this paper, we present a content-based retrieval approach that utilizes the texture features of geographical images. Various texture features are extracted using wavelet transforms. Based on the texture features, we design a hierarchical approach to cluster geographical images for effective and efficient retrieval, measuring distances between feature vectors in the feature space. Using wavelet-based multi-resolution decomposition, two different sets of texture features are formulated for clustering. For each feature set, different distance measurement techniques are designed and experimented for clustering images in a database. The experimental results demonstrate that the retrieval efficiency and effectiveness improve when our clustering approach is used. Keywords: geogr...
Dynamic Playout Scheduling Algorithms for Continuous Multimedia Streams.

Semantic Clustering and Querying on Heterogeneous Features for Visual Data.
The effectiveness of the content-based image retrieval can be enhanced using the heterogeneous features embedded in the images. However, since the features in texture, color, and shape are generated using different computation methods and thus may require different similarity measurements, the integration of the retrieval on heterogeneous features is a non-trivial task. In this paper, we present a semantics-based clustering and indexing approach, termed SemQuery,  to support visual queries on heterogeneous features of images. Using this approach, the database images are classified based on their heterogeneous features. Each semantic image cluster contains a set of subclusters that are represented by the heterogeneous features that the images contain. A database image is included into a feature subcluster only if the image contains all the features under the same cluster. We also design a multi-layer model to merge the results of basic queries on individual features. A visual query proc...
A Multi%2Dlevel Buffering and Feedback Scheme for Distributed Multimedia Presentation Systems.
Distributed multimedia presentation systems require flexibility and good quality of service for multimedia data presentations. To ensure flexible and satisfiable presentations of multimedia data, collaborations between servers, network, and clients must be carefully designed to retrieve the data from the disk and transfer the data to the client. In this paper, we investigate a multi-level buffering and feedback scheme to guarantee the on-time retrieval and transmission of multimedia data in the distributed multimedia presentation environments. In the multi-level buffering scheme, both client and server buffers are designed and collaborated to support the end-to-end multimedia data transmission. These buffers can absorb the rate variations of media streams in different locations. Local and remote feedback messages are used to dynamically prevent buffer overflow /underflow problems. Experiments demonstrate that highly smooth and synchronized presentations of multimedia streams can be sup...
Global Integration of Visual Databases.
Different visual databases have been designed in various locations. The global integration of such databases can enable users to access data across the world in a transparent manner. In this paper, we investigate an approach to the design and creation of an integrated information system which supports global visual query access to various visual databases over the Internet. Specifically, a metaserver including a hierarchical metadatabase, a metasearch agent, and a query manager is designed to support such an integration. The metadatabase houses abstracted data about individual remote visual databases. To support visual contentbased queries, the abstracted data in the metadatabase reflect the semantics of each visual database. The query manager extracts the feature contents from the queries. The metasearch agent processes the queries by matching their feature contents with the metadata. A list of relevant database sites is derived for efficient retrieval of the query in the selected dat...
NeuroMerge An Approach for Merging Heterogeneous Features in Content%2Dbased Image Retrieval Systems.

WaveCluster A Multi%2DResolution Clustering Approach for Very Large Spatial Databases.
Many applications require the management of spatial data. Clustering large spatial databases is an important problem which tries to find the densely populated regions in the feature space to be used in data mining, knowledge discovery, or efficient information retrieval. A good clustering approach should be efficient and detect clusters of arbitrary shape. It must be insensitive to the outliers (noise) and the order of input data. We pro-pose WaveCluster, a novel clustering approach based on wavelet transforms, which satisfies all the above requirements. Using multi-resolution property of wavelet transforms, we can effectively identify arbitrary shape clus-ters at different degrees of accuracy. We also demonstrate that WaveCluster is highly effi-cient in terms of time complexity. Experi-mental results on very large data sets are pre-sented which show the efficiency and effective-ness of the proposed approach compared to the other recent clustering methods.
NetView Integrating Large%2DScale Distributed Visual Databases.

Data Resource Selection in Distributed Visual Information Systems.
With the advances in multimedia databases and the popularization of the Internet, it is now possible to access large image and video repositories distributed throughout the world. One of the challenging problems in such an access is how the information in the respective databases can be summarized to enable an intelligent selection of relevant database sites based on visual queries. This paper presents an approach to solve this problem based on image content-based indexing of a metadatabase at a query distribution server. The metadatabase records a summary of the visual content of the images in each database through image templates and statistical features characterizing the similarity distributions of the images. The selection of the databases is done by searching the metadatabase using a ranking algorithm that uses query similarity to a template and the features of the databases associated with the template. Two selection approaches, termed mean-based and histogram-based approaches, ...
Buffer Model and Management in Distributed Multimedia Presentation Systems.

Efficient Resource Selection in Distributed Visual Information Systems.
With the advances in multimedia databases and the popularization of the Internet, it is now possible to access large multimedia data repositories distributed throughout the world. One of the challenging problems in such an access is how the information in the respective databases can be summarized to enable an intelligent selection of relevant database sites based on visual queries. This paper presents an approach to this problem that is based on image content-based indexing of a metadatabase at a query distribution server. The metadatabase records a summary of the visual content of the images per database through image templates and statistical features characterizing the similarity value distributions of images. The selection of databases is done by searching the metadatabase using a histogrambased ranking algorithm that use query similarity to a template and the features of databases associated with the icon. The database selection mechanism have been implemented as a metaserver and...
Geographical Image Classification and Retrieval.
Current retrieval methods in geographic image databases use only pixel-by-pixel spectral information. Texture is an important property of geographical images that can improve retrieval effectiveness and efficiency. In this paper, we present a content-based retrieval approach that utilizes the texture features of geographical images. Various texture features are extracted using wavelet transforms. Based on the texture features, we design a hierarchical approach to cluster geographical images for effective and efficient retrieval, measuring distances between feature vectors in the feature space. Using wavelet-based multi-resolution decomposition, two different sets of texture features are formulated for clustering. For each feature set, different distance measurement techniques are designed and experimented for clustering images in a database. The experimental results demonstrate that the retrieval efficiency and effectiveness improve when our clustering approach is used. Keywords: geogr...
A Framework for Supporting Quality%2DBased Multimedia Presentation in Educational Digital Libraries.

A Framework for Supporting Quality%2DBased Presentation of Continuous Multimedia Streams.
In this paper, we investigate a framework for supporting the continuous and synchronized presentation of multimedia streams in a distributed multimedia system. Assuming that the network transmission and the server provide sufficient support for delivering media objects, important issues regarding the enforcement of smooth presentations of multimedia streams must be addressed at client sites. We develop various presentation scheduling algorithms that are adaptable to qualityof -service parameters. The significance of the proposed algorithms is to adjust the presentation from its insynchrony by gradually catching up or slowing down rather than using skipping/pausing in an abrupt fashion. Experimental analysis conducted for the proposed approaches demonstrates that our algorithms can avoid hiccups in presentations. This framework can be readily used to facilitate various applications, including education and training. 1 Introduction  In a multimedia presentation system, multimedia data ar...
Meta%2DDatabase and Search Agent for Multimedia Database Access over Internet.

A Network Manager on Ethernets for Distributed Multimedia Systems.

WebView A Multimedia Database Resource Integration and Search System over Web.
In recent years, the Internet and the Web have enabled us to distribute multimedia data such that it can be shared by people across the world in a transparent manner. The information presentation capabilities of a Web browser make it a powerful tool to achieve this objective. This involves the creation of individual multimedia repositories at Web sites as well as search agents at the Web server which co-ordinate between clients and remote servers. However accessing multimedia information over the Web poses several challenges relating to the implementation of these systems in client-server environments when searching for images and other forms of data. In this paper, we describe the design and implementation of a system which achieves the above objective in an efficient manner. 1 Introduction  Many applications involve accessing remote multimedia databases for the purpose of retrieving information which could be in the form of photographs, x-rays, scanned articles or satellite pictures....
On Relaxing Serializability by Constraining Transaction Readsets.

Scheduling Multimedia Presentations in Educational Digital Libraries.


Supporting Content%2DBased Retrieval in Large Image Database Systems.
. In this paper, we investigate approaches to supporting effective and efficient retrieval of image data based on content. We first introduce an effective block-oriented image decomposition structure which can be used to represent image content in image database systems. We then discuss the application of this image data model to content-based image retrieval. Using wavelet transforms to extract image features, significant content features can be extracted from image data through decorrelating the data in their pixel format into frequency domain. Feature vectors of images can then be constructed. Content-based image retrieval is performed by comparing the feature vectors of the query image and the decomposed segments in database images. Our experimental analysis illustrates that the proposed block-oriented image representation offers a novel decomposition structure to be used to facilitate effective and efficient image retrieval.  Keywords: content-based image retrieval, image database...
Buffer Management in Multimedia Database Systems.
The delivery of continuous and synchronous multimedia data from a database server to multiple destinations over a network presents new challenges in the area of buffer management. Many factors that were not considered in conventional buffer management must be examined. In this paper, we investigate the principles of buffer management for multimedia data presentations in object-oriented database environments. The primary goal is to minimize the response time of multimedia presentations while ensuring that all continuity and synchronization requirements are satisfied. Minimum buffering requirements to guarantee the continuity and synchrony of the presentation of multimedia data are first proposed. A prefetching technique which satisfies these requirements is then developed. These principles and technique provide users with the full range of information required to develop a database environment for multimedia presentations. 1 Introduction  Advances in multimedia computing technologies ha...
NetMedia A Client%2DServer Distributed Multimedia Environment.

Block%2DOriented Image Decomposition and Retrieval in Image Database Systems.

Implementation of Video Presentation in Database Systems.

Global Committability in Multidatabase Systems.

A Fractal%2DBased Clustering Approach in Large Visual Database Systems.
Large visual database systems require effective and efficient ways of indexing and accessing visual data on the basis of content. In this process, significant features must first be extracted from image data in their pixel format. These features must then be classified and indexed to assist efficient access to image content. With the large volume of visual data stored in a visual database, image classification is a critical step to achieve efficient indexing and retrieval. In this paper, we investigate an effective approach to the clustering of image data based on the technique of fractal image coding, a method first introduced in conjunction with fractal image compression technique. A joint fractal coding technique, applicable to pairs of images, is used to determine the degree of their similarity. Images in a visual database can be categorized in clusters on the basis of their similarity to a set of iconic images. Classification metrics are proposed for the measurement of the extent ...
Texture%2Dbased Image Retrieval in Image Database Systems.

A View%2DBased Approach to Relaxing Global Serializability in a Multidatabase System %28Abstract%29.

DL%2DRaid An Environment for Supporting Digital Library Services.
Digital libraries are a repository of documents that are large volumes of integrated text, image, video and sound data. In such an environment, users may not have an efficient access mechanisms for the data, and in some cases may not even know what is available and how and where it is located. To facilitate the users in retrieving the documents from this vast information base, digital libraries must provide interactive support. This will allow the users to enter into a dialogue with an information base server and successively refine the query if the query is not sufficient to locate the desired information. In a wide area network (WAN), such a dialogue will be communication intensive. We are currently developing a digital library prototype called DL-Raid at the Raid laboratory at Purdue University to study the feasibility and sensitivity of various retrieval schemes in distributed environments. In this paper, we present the architecture of the DL-Raid and the data model supported by th...

On Global Transaction Scheduling Criteria in Multidatabase Systems.

On Structural Features of Global Transactions in Multidatabase Systems.

A modified radiosity algorithm for integrated visual and auditory rendering.

A Theory of Global Concurrency Control in Multidatabase Systems

Automatic Visual Inspection A Morphological Approach.

On the Classification and Existence of Structures in Default Logic.

